Fairness for Dynamic Control

نویسندگان

  • Jochen Hoenicke
  • Ernst-Rüdiger Olderog
  • Andreas Podelski
چکیده

Already in Lamport’s bakery algorithm, integers are used for fair schedulers of concurrent processes. In this paper, we present the extension of a fair scheduler from ‘static control’ (the number of processes is fixed) to ‘dynamic control’ (the number of processes changes during execution). We believe that our results shed new light on the concept of fairness in the setting of dynamic control.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic threshold control of RED for establishing fairness among thousands of TCP connections

RED (Random Early Detection) routers can provide better fairness among many competing TCP connections than TD (Tail-Drop) routers, but it is true only when the control parameters of RED are set appropriately according to the network congestion status. However, it is very difficult because the network condition varies largely, especially when the number of accommodated connections is large. In t...

متن کامل

The dynamic threthold control algorithm of RED for thousands of TCP flows

In this paper, we first investigate the performance of RED and the traditional TD (Tail-Drop) routers when there are more than 1000 TCP connections in the network, especially in term of fairness among connections. The result is that RED can achieve better fairness than TD when its control parameters are appropriately tuned according to the network condition. However, when the parameters are not...

متن کامل

Dynamic Vegas: A Competitive Congestion Control Strategy

TCP Vegas is regarded as balanced congestion control strategy, however, shortcomings such as low bandwidth utilization and not gain fairness when sharing link with TCP Reno. We reinvestigate these issues and propose a modification strategy called Dynamic Vegas, which changes initial TCP Vegas’ in slow start and congestion avoidance phase. It dynamically chooses slow start algorithm and adjust d...

متن کامل

A distributed power adaptation algorithm for multimedia delivery over ad hoc networks

There has been an increasing interest in recent years to deliver multimedia services over wireless ad hoc networks. Due to the existence of hidden terminal and absence of central control, the MAC protocol as used in the ad hoc networks may lead to channel capture, where some flows monopolize the channel while others suffer from starvation. This greatly degrades system throughput and fairness. A...

متن کامل

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010